Minimum Conditional Entropy Context Quantization

نویسندگان

  • Xiaolin Wu
  • Philip A. Chou
  • Xiaohui Xue
چکیده

We consider the problem of nding the quantizer Q that quantizes the K-dimensional causal context Ci = (Xi?t i ; Xi?t 2 ; : : : ; Xi?t K) of a source symbol Xi into one of M conditioning states such that the conditional entropy H (XijQ(Ci)) is minimized. The resulting minimum conditional entropy context quantizer can be used for sequential coding of the sequence X0 ; X1 ; X2 ; : : :.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Context Quantization for Adaptive Entropy Coding in Image Compression

Context based adaptive entropy coders are used in newer compression standards to achieve rates that are asymptotically close to the source entropy: separate arithmetic coders are used for a large number of possible conditioning classes. This greatly reduces the amount of sample data available for learning. To combat this problem, which is referred as the context dilution problem in the literatu...

متن کامل

A Rate-Constrained Block Matching Algorithm for Video Coding

The Rate Constrained Block Matching Algorithm, (RC-BMA), introduced in this paper, jointly minimizes Displaced Frame Di erence (DFD) variance and entropy or conditional entropy of motion vectors for determining the motion vectors. It is intended for use in low rate video coding applications where the contribution of the motion vector rate to the overall coding rate might be signi cant. The DFD ...

متن کامل

Conditional Entropy Constrained Tree Structured Vector Quantization with Applications to Sources with Memory

An algorithm is derived for designing tree structured vector quantizers to encode sources with memory The algorithm minimizes the average distortion subject to a conditional entropy constraint and the tree structure restriction This technique called conditional entropy constrained tree structured vector quantization CECTSVQ can more e ciently exploit the source memory This work is an extension ...

متن کامل

Conditional entropy-constrained residual VQ with application to image coding

This paper introduces an extension of entropy constrained residual vector quantization (VQ) where intervector dependencies are exploited. The method, which we call conditional entropy-constrained residual VQ, employs a high-order entropy conditioning strategy that captures local information in the neighboring vectors. When applied to coding images, the proposed method is shown to achieve better...

متن کامل

A Source Coding Approach to Classification by Vector Quantization and the Principle of Minimum Description Length

An algorithm for supervised classi cation using vector quantization and entropy coding is presented. The classi cation rule is formed from a set of training data f(Xi; Yi)g n i=1, which are independent samples from a joint distribution PXY . Based on the principle of Minimum Description Length (MDL), a statistical model that approximates the distribution PXY ought to enable e cient coding of X ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000